Matching Canny Edgels to Compute the Principal Components of Optic Flow
نویسندگان
چکیده
A relaxation algorithm for the computation of optic flow at edge elements (edgels) is presented. Flow is estimated only at intensity edges of the image. Edge elements, extracted from an intensity image, are used as the basis for the algorithm. A matching strength or weight surface is computed around each edgel and neighbourhood support obtained to enhance the matching strength. A principal moments method is used to determine the flow from this weight surface. The output of the algorithm is, for each edgel, a pair of orthogonal components of the estimate of the flow. Associated with each component is a confidence measure. Examples of the output of the algorithm are given, and tests of its accuracy are discussed.
منابع مشابه
Procedure to detect anatomical structures in optical fundus images
We present an overview of the design and test of an image processing procedure for detecting all important anatomical structures in color fundus images. These structures are the optic disk, the macula and the retinal network. The algorithm proceeds through five main steps: (1) automatic mask generation using pixels value statistics and color threshold, (2) visual image quality assessment using ...
متن کاملLocation and intensity discrimination in the leech local bend response quantified using optic flow and principal components analysis.
In response to touches to their skin, medicinal leeches shorten their body on the side of the touch. We elicited local bends by delivering precisely controlled pressure stimuli at different locations, intensities, and durations to body-wall preparations. We video-taped the individual responses, quantifying the body-wall displacements over time using a motion-tracking algorithm based on making o...
متن کاملUnified point-edgelet feature tracking
Feature tracking algorithms have conventionally tracked ‘corner’ features or windows with high spatial frequency content. However, this conventional point feature representation of scenes would be inappropriate for poorly textured image sequences like indoor image sequences. To overcome this problem, we propose a feature tracking algorithm which tracks point features and edgelets simultaneously...
متن کاملCompression of Breast Cancer Images By Principal Component Analysis
The principle of dimensionality reduction with PCA is the representation of the dataset ‘X’in terms of eigenvectors ei ∈ RN of its covariance matrix. The eigenvectors oriented in the direction with the maximum variance of X in RN carry the most relevant information of X. These eigenvectors are called principal components [8]. Ass...
متن کاملCompression of Breast Cancer Images By Principal Component Analysis
The principle of dimensionality reduction with PCA is the representation of the dataset ‘X’in terms of eigenvectors ei ∈ RN of its covariance matrix. The eigenvectors oriented in the direction with the maximum variance of X in RN carry the most relevant information of X. These eigenvectors are called principal components [8]. Ass...
متن کامل